An Efficient Library for Solving CSP with Local Search

In the last years, the application of local search techniques for constraint solving started to raise some interest in the Constraint Programming community, We proposed some years ago a domain-independent local search method called Adaptive Search for solving Constraint Satisfaction Problems (CSP) [1]. This method has now been fully re-implemented as a C-based framework library available as freeware (both source code and several benchmark examples) at the URL : http://contraintes.inria.fr/~diaz/adaptive/. This new implementation is more generic and efficient than the previous version used in [1], but is dedicated to permutation problems, that is : all variables have a same initial domain and are subject to an implicit all-different constraint. Many classical problems fall into this category.